How close are the eigenvectors and eigenvalues of the sample and actual covariance matrices?

نویسنده

  • Andreas Loukas
چکیده

How many samples are sufficient to guarantee that the eigenvectors and eigenvalues of the sample covariance matrix are close to those of the actual covariance matrix? For a wide family of distributions, including distributions with finite second moment and distributions supported in a centered Euclidean ball, we prove that the inner product between eigenvectors of the sample and actual covariance matrices decreases proportionally to the respective eigenvalue distance. Our findings imply non-asymptotic concentration bounds for eigenvectors, eigenspaces, and eigenvalues. They also provide conditions for distinguishing principal components based on a constant number of samples.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

How Close Are the Eigenvectors of the Sample and Actual Covariance Matrices?

How many samples are sufficient to guarantee that the eigenvectors of the sample covariance matrix are close to those of the actual covariance matrix? For a wide family of distributions, including distributions with finite second moment and sub-gaussian distributions supported in a centered Euclidean ball, we prove that the inner product between eigenvectors of the sample and actual covariance ...

متن کامل

New Probabilistic Bounds on Eigenvalues and Eigenvectors of Random Kernel Matrices

Kernel methods are successful approaches for different machine learning problems. This success is mainly rooted in using feature maps and kernel matrices. Some methods rely on the eigenvalues/eigenvectors of the kernel matrix, while for other methods the spectral information can be used to estimate the excess risk. An important question remains on how close the sample eigenvalues/eigenvectors a...

متن کامل

On convergence of sample and population Hilbertian functional principal components

In this article we consider the sequences of sample and population covariance operators for a sequence of arrays of Hilbertian random elements. Then under the assumptions that sequences of the covariance operators norm are uniformly bounded and the sequences of the principal component scores are uniformly sumable, we prove that the convergence of the sequences of covariance operators would impl...

متن کامل

Analysis of Eigenspace Dynamics with Applications to Array Processing

For an N-element array (Fig.1(a)), methods such as beamforming and singular value decomposition rely on estimation of the sample covariance matrix, computed from M independent data snapshots. As ∞ → M , the sample covariance is a consistent estimator of the true population covariance. However, this ideal condition cannot be met in most practical situations, in which large-aperture arrays operat...

متن کامل

14: Analysis of Eigenspace Dynamics with Applications to Array Processing

For an N-element array (Fig.1(a)), methods such as beamforming and singular value decomposition rely on estimation of the sample covariance matrix, computed from M independent data snapshots. As ∞ → M , the sample covariance is a consistent estimator of the true population covariance. However, this ideal condition cannot be met in most practical situations, in which large-aperture arrays operat...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017